Parallel nonlinear AOR method and its convergence

Improving Results on Convergence of AOR Method

A note on the convergence of the AOR method

In Gao and Huang [Z.X. Gao, T.Z Huang, Convergence of AOR method, Appl. Math. Comput. 176 (2006) 134–140] some practical sufficient conditions for the convergence of the AOR (accelerated overrelaxation) method for solving linear system Ax 1⁄4 b, with A being doubly diagonally dominant matrix, are presented. Using a different approach we will give some improvements in both cases, when the matrix...

Convergence Analysis of Preconditioned AOR Iterative Method for Linear Systems

MHmatrices appear in many areas of science and engineering, for example, in the solution of the linear complementarity problem LCP in optimization theory and in the solution of large systems for real-time changes of data in fluid analysis in car industry. Classical stationary iterative methods used for the solution of linear systems have been shown to convergence for this class of matrices. In ...

Modified frame algorithm and its convergence acceleration by Chebyshev method

The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...

Non - Stationary Parallel Multisplitting Aor Methods ∗

Non-stationary parallel multisplitting iterative methods based on the AOR method are studied for the solution of nonsingular linear systems. Convergence of the synchronous and asyn-chronous versions of these methods is studied for H–matrices. Furthermore, computational results about these methods on both shared and distributed memory multiprocessors are discussed. The numerical examples present...